منابع مشابه
Principal components: A descent algorithm
Many frequently arising problems involve finding the small-dimensional subspace that best captures the variablity of a set of observations belonging to a larger space, for example, finding its principal components. We propose an algorithm that finds this subspace through a series of orthogonal rotations, each represented as the exponential of a skew-symmetric matrix picked such that we minimize...
متن کاملA Principal Components Analysis Neural Gas Algorithm for Anomalies Clustering
Neural gas network is a single-layered soft competitive neural network, which can be applied to clustering analysis with fast convergent speed comparing to Self-organizing Map (SOM), K-means etc. Combining neural gas with principal component analysis, this paper proposes a new clustering method, namely principal components analysis neural gas (PCA-NG), and the online learning algorithm is also ...
متن کاملA near-optimal algorithm for differentially-private principal components
The principal components analysis (PCA) algorithm is a standard tool for identifying good lowdimensional approximations to high-dimensional data. Many data sets of interest contain private or sensitive information about individuals. Algorithms which operate on such data should be sensitive to the privacy risks in publishing their outputs. Differential privacy is a framework for developing trade...
متن کاملFuzzy Clustering Algorithm Extracting Principal Components Independent of Subsidiary Variables
Fuzzy c-varieties (FCV) is one of the clustering algorithms in which the prototypes are multi-dimensional linear varieties. The linear varieties are represented by some local principal component vectors and the FCV clustering algorithm can be regarded as a simultaneous algorithm of fuzzy clustering and principal component analysis. However, obtained principal components are sometimes strongly i...
متن کاملDetecting influential observations in principal components and common principal components
Detecting outlying observations is an important step in any analysis, even when robust estimates are used. In particular, the robustified Mahalanobis distance is a natural measure of outlyingness if one focuses on ellipsoidal distributions. However, it is well known that the asymptotic chi-square approximation for the cutoff value of the Mahalanobis distance based on several robust estimates (l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2014
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2014.02.033